Moment-Based Spectral Analysis of Random Graphs with Given Expected Degrees
نویسندگان
چکیده
منابع مشابه
The Spectral Gap of Random Graphs with Given Expected Degrees
We investigate the Laplacian eigenvalues of a random graphG(n,d) with a given expected degree distribution d. The main result is that w.h.p. G(n,d) has a large subgraph core(G(n,d)) such that the spectral gap of the normalized Laplacian of core(G(n,d)) is ≥ 1− c0d̄ min with high probability; here c0 > 0 is a constant, and d̄min signifies the minimum expected degree. The result in particular appli...
متن کاملSpectral Partitioning of Random Graphs with Given Expected Degrees
It is a well established fact, that – in the case of classical random graphs like (variants of) Gn,p or random regular graphs – spectral methods yield efficient algorithms for clustering (e. g. colouring or bisection) problems. The theory of large networks emerging recently provides convincing evidence that such networks, albeit looking random in some sense, cannot sensibly be described by clas...
متن کاملSpectra of random graphs with given expected degrees.
In the study of the spectra of power-law graphs, there are basically two competing approaches. One is to prove analogues of Wigner's semicircle law, whereas the other predicts that the eigenvalues follow a power-law distribution. Although the semicircle law and the power law have nothing in common, we will show that both approaches are essentially correct if one considers the appropriate matric...
متن کاملThe Spectra of Random Graphs with Given Expected Degrees
In the study of the spectra of power law graphs, there are basically two competing approaches. One is to prove analogues of Wigner’s semi-circle law while the other predicts that the eigenvalues follow a power law distributions. Although the semi-circle law and the power law have nothing in common, we will show that both approaches are essentially correct if one considers the appropriate matric...
متن کاملThe average distances in random graphs with given expected degrees.
Random graph theory is used to examine the "small-world phenomenon"; any two strangers are connected through a short chain of mutual acquaintances. We will show that for certain families of random graphs with given expected degrees the average distance is almost surely of order log nlog d, where d is the weighted average of the sum of squares of the expected degrees. Of particular interest are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Network Science and Engineering
سال: 2017
ISSN: 2327-4697
DOI: 10.1109/tnse.2017.2712064